Domination and (In)visibility: Reading Power Relations at Tel Mor
نویسندگان
چکیده
منابع مشابه
Restricted power domination and fault-tolerant power domination on grids
The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system, which is closely related to the classical domination problem in graphs. For a graph G = (V , E), the power domination number of G is the minimum cardinality of a set S ⊆ V such that PMUs placed on every vertex of S results in all of V being observed. A ver...
متن کاملParameterized power domination complexity
The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible is known as Power Dominating Set. Nodes can be measured indirectly according to Kirchhoff’s law. We show that this problem can be solved in linear time for graphs of bounded treewidth and establish bounds on its parameterized complexity if the number of PMUs is the par...
متن کاملReading 11 : Relations and Functions
In reading 3, we described a correspondence between predicates on one variable and sets. A predicate defines a set, namely the set of all elements of the domain that satisfy the predicate. Conversely, any set S defines a predicate P (x): x ∈ S. Today we discuss an extension of this correspondence to predicates on two variables. Consider a predicate P (x, y) where x ∈ D 1 and y ∈ D 2 (recall tha...
متن کاملEstablishing Propositional Relations in Reading Stories
This study examined the establishment of coherence relations by Persian EFL learners in their reading of stories. 201 undergraduate EFL learners read narrative passages and selected appropriate coherence elements of different types necessary for the proper construction of meaning. The results demonstrated a consistent pattern of a text-specific hierarchy for the comprehension of conjunctive rel...
متن کاملGeneralized power domination of graphs
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Archaeology
سال: 2009
ISSN: 1939-828X
DOI: 10.3764/ajaonline1131.cline